Lot-sizing with stock upper bounds and fixed charges

نویسندگان

  • Marco DI SUMMA
  • Laurence A. WOLSEY
چکیده

Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtained as the intersection of two simpler sets, one involving just 0-1 variables and the second a mixing set with a variable upper bound constraint. For these two sets we derive both inequality descriptions and polynomial-size extended formulations of their respective convex hulls. Finally we carry out some limited computational tests on single-item constant capacity lot-sizing problems with upper bounds and fixed charges on the stock variables in which we use the extended formulations derived above to strengthen the initial mixed integer programming formulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges

Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...

متن کامل

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

[1] Corresponding author e-mail: [email protected]   [1] Corresponding author e-mail: [email protected]   Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...

متن کامل

Core Discussion Paper 9917 the Uncapacitated Lot-sizing Problem with Sales and Safety Stocks

We examine a variant of the uncapacitated lot-sizing model of WagnerWhitin involving sales instead of fixed demands, and lower bounds on stocks. Two extended formulations are presented, as well as a dynamic programming algorithm and a complete description of the convex hull of solutions. When the lower bounds on stocks are non-decreasing over time, it is possible to describe an extended formula...

متن کامل

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of ...

متن کامل

Relax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups

  This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009